Task Allocation Via Coalition Formation Among Autonomous Agents
نویسندگان
چکیده
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents which will perform the task. The allocation of tasks to groups of agents is necessary when tasks cannot be performed by a single agent. It may also be useful to assign groups of agents to tasks when the group's performance is more e cient than the performance of single agents. In this paper we give an e cient solution to the problem of task allocation among autonomous agents, and suggest that the agents will form coalitions in order to perform tasks or improve the e ciency. We present a distributed algorithmwith a low ratio bound and with a low computational complexity. Our algorithm is an any-time algorithm, it is simple, e cient and easy to implement.
منابع مشابه
Methods for Task Allocation via Agent Coalition Formation
Task execution in multi-agent environments may require cooperation among agents. Given a set of agents and a set of tasks which they have to satisfy, we consider situations where each task should be attached to a group of agents that will perform the task. Task allocation to groups of agents is necessary when tasks cannot be performed by a single agent. However it may also be beneficial when gr...
متن کاملReal-Time Satisficing Multiagent Coalition Formation
In a multiagent system where each agent has only an incomplete view of the world, optimal coalition formation is difficult. Coupling that with real-time and resource constraints often makes the rationalization process infeasible or costly. We propose a coalition formation approach that identifies and builds sub-optimal yet satisficing coalitions among agents to solve a problem detected in the e...
متن کاملFormation of overlapping coalitions for precedence-ordered task-execution among autonomous agents *
(;ell-satisfaction in multi-agent environments via coalition formation may be beneficial in cases where agents cannot perform goals by themselves or they do so inefficiently. Agent coalition forn|alkm typically requires that each agent must be a member of only Olle coalition. This may lead to wasted resources alld capabilities. Therefore, we. present algorithms that lead agents to the formation...
متن کاملMulti-agent Based Execution Environment for Task Allocation via Coalition Formation
This paper focuses on a solution to the problem of task allocation through coalition formation and presents the design and implementation of a framework for this purpose. The framework serves as a multi-agent execution environment where worker agents follow the Shehory-Kraus’s coalition formation algorithm to negotiate and form coalitions. Worker agents prefer to form an optimal coalition to ma...
متن کاملMaximal Clique Based Distributed Group Formation For Task Allocation in Large-Scale Multi-Agent Systems
We present a fully distributed algorithm for group or coalition formation among autonomous agents. The algorithm is based on two main ideas. One is a distributed computation of maximal cliques (of up to pre-specified size) in the underlying graph that captures the interconnection topology of the agents. Hence, given the current configuration of the agents, the groups that are formed are charact...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995